BI-OBJECTIVE GOAL PROGRAMMING FOR AIRLINE CREW PAIRING

نویسندگان

چکیده

The crew cost constitutes 20% of the direct operating in airline operations after aircraft fuel cost. Effective scheduling can save tens millions dollars to airlines and result low-cost flight tickets for passengers improved quality life crew. pairing requires addressing union expectations, company rules, regulations countries' civil aviation authorities. In this study, bi-objective goal programming is proposed minimize number perform flights pairings while challenging issues mentioned above. integer set-covering model formulated solved using GAMS mathematical software. results showed that could provide significant advantages airlines. computational experiments have been performed over a set real data.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Airline Crew Pairing: Move-up Crews

Due to irregular operations, the crew cost at the end of a month is typically substantially higher than the projected crew cost in planning. We assume that the fleeting and the aircraft routing decisions have already been made. We present a model and a solution methodology that produces robust crew schedules in planning. Besides the objective of minimizing the crew cost, we introduce the object...

متن کامل

A Subsequence Generation Approach for the Airline Crew Pairing Problem

In this paper we consider an important problem for the airline industry. The widely studied crew pairing problem is typically formulated as a set partitioning problem and solved using the branchand-price methodology. Here we develop a new integer programming framework, based on the concept of subsequence generation, for solving the set partitioning formulation. In subsequence generation one res...

متن کامل

Multiobjective Optimization Genetic Algorithms for Domestic Airline Crew Pairing Problems

Airline crew pairing problems involve assigning the required crew members to each flight segment in a given time period, while complying with a variety of work regulations and collective agreements. Traditional researches formulate the pairing problems as integer programming problems, and use deterministic approaches to optimize the solutions. Such these approaches usually suffer from some crit...

متن کامل

High Level Rule Modeling Language for Airline Crew Pairing

The crew pairing problem is an airline optimization problem where a set of least costly pairings (consecutive flights to be flown by a single crew) that covers every flight in a given flight network is sought. A pairing is defined by using a very complex set of feasibility rules imposed by international and national regulatory agencies, and also by the airline itself. The cost of a pairing is a...

متن کامل

Column Generation and the Airline Crew Pairing Problem

The cost of ight crews is the second largest operating cost of an airline. Minimizing it is a fundamental problem in airline planning and operations, and one which has leant itself to mathematical optimization. We discuss several recent advances in the methods used to solve these problems. After describing the general approach taken, we discuss a new method which can be used to obtain approxima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Eskis?ehir technical university journal of science and technology a- applied sciences and engineering

سال: 2022

ISSN: ['2667-4211']

DOI: https://doi.org/10.18038/estubtda.979777